Vertex-disjoint Copies of K
نویسندگان
چکیده
Let G be a graph of order n. Let K− l be the graph obtained from Kl by removing one edge. In this paper, we propose the following conjecture: Let G be a graph of order n ≥ lk with δ(G) ≥ (n−k+1) l−3 l−2 +k−1. Then G has k vertex-disjoint K− l . This conjecture is motivated by Hajnal and Szemerédi’s [6] famous theorem. In this paper, we verify this conjecture for l = 4.
منابع مشابه
Vertex-disjoint copies of K4- in graphs
Let K− 4 denote the graph obtained from K4 by removing one edge. Let k be an integer with k ≥ 2. Kawarabayashi conjectured that if G is a graph of order n ≥ 4k + 1 with σ2(G) ≥ n + k, then G has k vertex-disjoint copies of K− 4 . In this paper, we settle this conjecture affirmatively.
متن کاملDisjoint Stars and Forbidden Subgraphs
Let r, k be integers with r ≥ 3, k ≥ 2. We prove that if G is a K1,rfree graph of order at least (k− 1)(2r − 1) + 1 with δ(G) ≥ 2, then G contains k vertex-disjoint copies of K1,2. This result is motivated by characterizing a forbidden subgraph H which satisfies the statement “every H-free graph of sufficiently large order with minimum degree at least t contains k vertex-disjoint copies of a st...
متن کاملOn the commuting graph of non-commutative rings of order $p^nq$
Let $R$ be a non-commutative ring with unity. The commuting graph of $R$ denoted by $Gamma(R)$, is a graph with vertex set $RZ(R)$ and two vertices $a$ and $b$ are adjacent iff $ab=ba$. In this paper, we consider the commuting graph of non-commutative rings of order pq and $p^2q$ with Z(R) = 0 and non-commutative rings with unity of order $p^3q$. It is proved that $C_R(a)$ is a commutative ring...
متن کاملVertex-Disjoint Copies of K1 + (K1 ∪K2) in Graphs
Let S denote the graph obtained from K4 by removing two edges which have an endvertex in common. Let k be an integer with k ≥ 2. Let G be a graph with |V (G)| ≥ 4k and σ2(G) ≥ |V (G)|/2 + 2k− 1, and suppose that G contains k vertex-disjoint triangles. In the case where |V (G)| = 4k+2, suppose further that G K4t+3 ∪ K4k−4t−1 for any t with 0 ≤ t ≤ k − 1. Under these assumptions, we show that G c...
متن کاملThe upper domatic number of powers of graphs
Let $A$ and $B$ be two disjoint subsets of the vertex set $V$ of a graph $G$. The set $A$ is said to dominate $B$, denoted by $A rightarrow B$, if for every vertex $u in B$ there exists a vertex $v in A$ such that $uv in E(G)$. For any graph $G$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_p}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i rightarrow V_j$ or $V_j rightarrow...
متن کاملDistance magic labelings of a union of graphs
A 1-vertex-magic vertex labeling of a graph G(V,E) with p vertices is a bijection f from the vertex set V (G) to the integers 1, 2, . . . , p with the property that there is a constant k such that at any vertex x the sum ∑ f(x) taken over all neighbors of x is k. In this paper, we study the 1-vertex-magic vertex labelings of two families of disconnected graphs, namely a disjoint union of m copi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004